TSP Art
نویسندگان
چکیده
Bosch and Herman recently described how to use the traveling salesman problem (TSP) to construct a continuous line drawing based on a user-supplied image. They create a distribution of “cities” that approximates the darkness of the source image, and pass the cities to a heuristic TSP solver. We discuss their method and present alternative algorithms for city distribution that yield more attractive line drawings.
منابع مشابه
Improving the State of the Art in Inexact TSP Solving Using Per-Instance Algorithm Selection
We investigate per-instance algorithm selection techniques for solving the Travelling Salesman Problem (TSP), based on the two state-of-the-art inexact TSP solvers, LKH and EAX. Our comprehensive experiments demonstrate that the solvers exhibit complementary performance across a diverse set of instances, and the potential for improving the state of the art by selecting between them is significa...
متن کاملImproving the Asymmetric TSP by Considering Graph Structure
Recent works on cost based relaxations have improved Constraint Programming (CP) models for the Traveling Salesman Problem (TSP). We provide a short survey over solving asymmetric TSP with CP. Then, we suggest new implied propagators based on general graph properties. We experimentally show that such implied propagators bring robustness to pathological instances and highlight the fact that grap...
متن کاملAlgorithm selection for TSP with time constraints on the algorithms
The Travelling Salesman Problem (TSP) has been extensively studied in the literature and various solvers are available. However, none of the state-of-the-art solvers for TSP outperforms the others on all problem instances within a given time limit. Therefore, predicting the best performing algorithm for a particular instance is of a practical importance. In this paper, the TSP is studied in con...
متن کاملSolving Arc Routing Problems Using the Lin-Kernighan-Helsgaun Algorithm
It is well known that many arc routing problems can be transformed into the Equality Generalized Traveling Salesman Problem (E-GTSP), which in turn can be transformed into a standard Asymmetric Traveling Salesman Problem (TSP). This opens up the possibility of solving arc routing problems using existing solvers for TSP. This paper evaluates the performance of the state-of-the art TSP solver Lin...
متن کاملNew approximation algorithms for the TSP
The traveling salesman problem (TSP) is probably the best known combinatorial optimization problem. Although studied intensively for sixty years, the TSP continues to pose grand challenges. Cook’s [2012] recent book gives an excellent introduction. Since the TSP is NP-hard (Karp [1972]), it is natural to ask for approximation algorithms. How good solutions can we guarantee to find in polynomial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005